Bowen Lemma in the Countable Symbolic Space

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bowen Lemma in the Countable Symbolic Space

We consider the sets of quasi-regular points in the countable symbolic space. We measure the sizes of the sets by Billingsley-Hausdorff dimension defined by Gibbs measures. It is shown that the dimensions of those sets, always bounded from below by the convergence exponent of the Gibbs measure, are given by a variational principle, which generalizes Li and Ma’s result and Bowen’s result.

متن کامل

Dimension of Besicovitch-eggleston Sets in Countable Symbolic Space

This paper is mainly concerned with Hausdorff dimensions of Besicovitch-Eggleston subsets in countable symbolic space. A notable point is that, the dimension values posses a universal lower bound depending only on the underlying metric. As a consequence of the main results, we obtain Hausdorff dimension formulas for sets of real numbers with prescribed digit frequencies in their Lüroth expansions.

متن کامل

Countable subgroups of Euclidean space

In his paper [1], Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups. Such a group is Kσ, the countable union of compact sets. He notes that the group of rationals under addition with the discrete topology is an example of a Polish group which is Kσ (since it is countable) but not compactly generated (since compact subsets are finite). Beros showe...

متن کامل

Compactness in Countable Fuzzy Topological Space

A generalized fuzzy topological space called countable fuzzy topological space has already been introduced by the authors. The generalization has been performed by relaxing the criterion of preservation of arbitrary supremum of fuzzy topology to countable supremum. In this paper the notion of fuzzy compactness called c-compactness has been initiated and various properties are studied. Other rel...

متن کامل

Co-adaptive learning over a countable space

Co-adaptation is a special form of on-line learning where an algorithm A must assist an unknown algorithm B to perform some task. This is a general framework and has applications in recommendation systems, search, education, and much more. Today, the most common use of co-adaptive algorithms is in brain-computer interfacing (BCI), where algorithms help patients gain and maintain control over pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2017

ISSN: 1099-4300

DOI: 10.3390/e19100532